Enumerating wreath products via Garsia-Gessel bijections
نویسندگان
چکیده
Abstract. We generalize two bijections due to Garsia and Gessel to compute the generating functions of the two vector statistics (desG,maj, lG, col) and (desG, idesG,maj, imaj, col, icol) over the wreath product of a symmetric group by a cyclic group. Here desG, lG, maj, col, idesG, imajG, and icol denote the number of descents, length, major index, color weight, inverse descents, inverse major index, and inverse color weight, respectively. Our main formulas generalize and unify several known identities due to Brenti, Carlitz, Chow-Gessel, Garsia-Gessel, and Reiner on various distributions of statistics over Coxeter groups of type A and B.
منابع مشابه
Recent Results for the Q-lagrange Inversion Formula
A survey of the q-Lagrange inversion formula is given, including recent work of Garsia, Gessel, Hofbauer, Krattenthaler, Remmel, and Stanton. Some applications to identities of Rogers-Ramanujan type are stated.
متن کاملA Bijective Proof of a Major Index Theorem of Garsia and Gessel
In this paper we provide a bijective proof of a theorem of Garsia and Gessel describing the generating function of the major index over the set of all permutations of [n] = {1, ..., n} which are shuffles of given disjoint ordered sequences π1, ..., πk whose union is [n]. The proof is based on a result (an “insertion lemma”) of Haglund, Loehr, and Remmel which describes the change in major index...
متن کاملLagrange Inversion and Schur Functions
Macdonald defined an involution on symmetric functions by considering the Lagrange inverse of the generating function of the complete homogeneous symmetric functions. The main result we prove in this note is that the images of skew Schur functions under this involution are either Schur positive or Schur negative symmetric functions. The proof relies on the combinatorics of Lagrange inversion. W...
متن کاملq-Catalan Numbers
q-analogs of the Catalan numbers c', = (I/(n + I))($) are studied from the viewpoint of Lagrange inversion. The first, due to Carhtz, corresponds to the Andrews-Gessel-Garsia q-Lagrange inversion theory, satisfies a nice recurrence relation and counts inversions of Catalan words. The second, tracing back to Mac Mahon, arise from Krattenthaler's and Gessel and Stanton's q-Lagrange inversion form...
متن کاملCyclic Derangements
A classic problem in enumerative combinatorics is to count the number of derangements, that is, permutations with no fixed point. Inspired by a recent generalization to facet derangements of the hypercube by Gordon and McMahon, we generalize this problem to enumerating derangements in the wreath product of any finite cyclic group with the symmetric group. We also give qand (q, t)-analogs for cy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Eur. J. Comb.
دوره 32 شماره
صفحات -
تاریخ انتشار 2011